Probability CONTAGIOUS SETS IN RANDOM GRAPHS
نویسندگان
چکیده
We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least r active neighbors. A contagious set is a set whose activation results with the entire graph being active. Given a graph G, let m(G, r) be the minimal size of a contagious set. We study this process on the binomial random graph G := G(n, p)
منابع مشابه
The front of the epidemic spread and first passage percolation
In this paper we establish a connection between epidemic models on random networks with general infection times considered in [2] and first passage percolation. Using techniques developed in [6], when each vertex has infinite contagious periods, we extend results on the epidemic curve in [2] from bounded degree graphs to general sparse random graphs with degrees having finite third moments as n...
متن کاملContagious Sets in Random Graphs
We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least 2 active neighbors. A contagious set is a set whose activation results with the entire graph being active. Given a graph G, let m(G, 2) be the minimal size of a contagious set. We consider the binomial random grap...
متن کاملApplication of tests of goodness of fit in determining the probability density function for spacing of steel sets in tunnel support system
One of the conventional methods for temporary support of tunnels is to use steel sets with shotcrete. The nature of a temporary support system demands a quick installation of its structures. As a result, the spacing between steel sets is not a fixed amount and it can be considered as a random variable. Hence, in the reliability analysis of these types of structures, the selection of an appropri...
متن کاملCelebrating 50 Years of the Applied Probability Trust
We establish a connection between epidemic models on random networks with general infection times considered in Barbour and Reinert (2013) and first passage percolation. Using techniques developed inBhamidi, van derHofstad andHooghiemstra (2012), when each vertex has infinite contagious periods, we extend results on the epidemic curve in Barbour and Reinert (2013) from bounded degree graphs to ...
متن کاملSecond-Order Random Graphs For Modeling Sets Of Attributed Graphs And Their Application To Object Learning And Recognition
The aim of this article is to present a random graph representation, that is based on 2 order relations between graph elements, for modeling sets of attributed graphs (AGs). We refer to these models as second-order random graphs (SORGs). The basic feature of SORGs is that they include both marginal probability functions of graph elements and 2order joint probability functions. This allows a mor...
متن کامل